#include<vector>
#include<string>
using namespace std;

bool isMatch(string s, string p) {
    int m = s.size(), n = p.size();
    vector<vector<bool>> dp(m + 1, vector<bool>(n + 1));
    s = " " + s;
    p = " " + p;
    dp[0][0] = true;
    for (int i = 2; i <= n; i += 2)
    {
        if (p[i] == '*') dp[0][i] = true;
        else break;
    }
    for (int i = 1; i <= m; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (p[j] == '*')
            {
                if (p[j - 1] == '.') dp[i][j] = dp[i][j - 2] || dp[i - 1][j];
                else dp[i][j] = s[i] == p[j - 1] ? dp[i][j - 2] || dp[i - 1][j] : dp[i][j - 2];
            }
            else if (p[j] == '.')
            {
                dp[i][j] = dp[i - 1][j - 1];
            }
            else
                if (p[j] == s[i])
                    dp[i][j] = dp[i - 1][j - 1];
        }
    }
    return dp[m][n];
}

bool isInterleave(string s1, string s2, string s3) {
    int m = s1.size(), n = s2.size(), k = s3.size();
    vector<vector<bool>> dp(m + 1, vector<bool>(n + 1));
    if (k == 0) dp[0][0] = true;
    s1 = " " + s1, s2 = " " + s2, s3 = " " + s3;
    for (int i = 1; i <= n; i++)
    {
        if (s2[i] == s3[i]) dp[0][i] = true;
        else break;
    }
    for (int i = 1; i <= m; i++)
    {
        if (s1[i] == s3[i]) dp[i][0] = true;
        else break;
    }
    for (int i = 1; i <= m; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (i + j > k) break;
            dp[i][j] = (s1[i] == s3[i + j] && dp[i - 1][j]) || (s2[j] == s3[i + j] && dp[i][j - 1]);
        }
    }
    return dp[m][n];
}

int main()
{
    isMatch("a", ".*..a*");
    isInterleave("a", "", "aa");

	return 0;
}